M-partitions: optimal partitions of weight for one scale pan

نویسنده

  • Edwin O'Shea
چکیده

An M -partition of a positive integer m is a partition with as few parts as possible such that any positive integer less than m has a partition made up of parts taken from that partition of m. This is equivalent to partitioning a weight m so as to be able to weigh any integer weight l < m with as few weights as possible and only one scale pan. We show that the number of parts of an M -partition is a log-linear function of m and the M -partitions of m correspond to lattice points in a polytope. We exhibit a recurrence relation for counting the number of M -partitions of m and, for “half” of the positive integers, this recurrence relation will have a generating function. The generating function will be, in some sense, the same as the generating function for counting the number of distinct binary partitions for a given integer.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tsallis Entropy and Conditional Tsallis Entropy of Fuzzy Partitions

The purpose of this study is to define the concepts of Tsallis entropy and conditional Tsallis entropy of fuzzy partitions and to obtain some results concerning this kind entropy. We show that the Tsallis entropy of fuzzy partitions has the subadditivity and concavity properties. We study this information measure under the refinement and zero mode subset relations. We check the chain rules for ...

متن کامل

k-Efficient partitions of graphs

A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...

متن کامل

Stirling number of the fourth kind and lucky partitions of a finite set

The concept of Lucky k-polynomials and in particular Lucky χ-polynomials was recently introduced. This paper introduces Stirling number of the fourth kind and Lucky partitions of a finite set in order to determine either the Lucky k- or Lucky χ-polynomial of a graph. The integer partitions influence Stirling partitions of the second kind.

متن کامل

CFD analysis of natural convection heat transfer in a square cavity with partitions utilizing Al2O3 nanofluid

In the present study, natural convective heat transfer in a partitioned square cavity utilizing nanofluids is studied. The vertical left and right walls are considered as the hot and cold walls, respectively and the partitions assumed to be adiabatic. The nanofluid used in this study is Al2O3 with the volume fraction of 20%. It is assumed that nanofluid is a single phase f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 289  شماره 

صفحات  -

تاریخ انتشار 2004